Lecture Notes on Winning Strategies & Regions

نویسنده

  • André Platzer
چکیده

This lecture continues the study of hybrid games and their logic, differential game logic [Pla15], that Lecture 20 on Hybrid Systems & Games started. Lecture 20 saw the introduction of differential game logic with a focus on identifying and highlighting the new dynamical aspect of adversarial dynamics. The meaning of hybrid games in differential game logic had been left informal, based on the intuition one relates to interactive gameplay and decisions in trees. While it is possible to turn such a tree-type semantics into an operational semantics for hybrid games [Pla15], the resulting development is technically rather involved. Even if such an operational semantics is interesting and touches on interesting concepts from descriptive set theory, it is unnecessarily complicated compared. This lecture will, thus, be devoted to developing a much simpler yet rigorous semantics, a denotational semantics of hybrid games. Lecture 20 already highlighted subtleties how never-ending game play ruins determinacy, simply because there never is a state in which the winner would be declared. Especially the aspect of repetition and its interplay with differential equations will need careful attention. The denotational semantics will make this subtle aspect crystal clear. These lecture notes are based on [Pla15], where more information can be found on logic and hybrid games. The most important learning goals of this lecture are:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture Notes on Winning & Proving Hybrid Games

This lecture continues the study of hybrid games and their logic, differential game logic [Pla15], whose syntax was introduced in Lecture 20 on Hybrid Systems & Games and whose semantics was developed in Lecture 21 on Winning Strategies & Regions. Today’s lecture furthers the development of differential game logic to the third leg of the logical trinity: its axiomatics. This lecture will focus ...

متن کامل

Strategy Construction for Parity Games with Imperfect Information

We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids ...

متن کامل

Lecture 10: Complementation via Alternating Automata

The last theorem of Lecture 9 assures us that in any Büchi game one of the two players has a positional winning strategy. Thus, for any alternating Büchi automaton (ABA ) A and word w, either the automaton or the pathfinder has a positional winning strategy in the game G(A,w). Thus, if A accepts w there is a positional run for A on w. Consider the ABA A1 from the previous lecture. Here is a pos...

متن کامل

Factors affecting students tendency of Univercity students to Lecture Notes

Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...

متن کامل

Uniform Solution of Parity Games on Prefix-Recognizable Graphs

Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013